Semantical Analysis of Modal Logic Ii. Non-normal Modal Propositional Calculi

نویسنده

  • SAUL A. KRIPKE
چکیده

This paper continues the investigations of Kripke [63]. Not only is Kripke [63] presupposed; the reader is advised to have it on hand for ready reference. The notations and terminology of that paper are used freely; in particular, P, Q, R, ... are atomic formulae, and A, B, 0, ... are arbitrary formulae built from them using the connectives A, ~, O. All propositional calculi in this paper have the same formation rules as those of Kripke [63]. However, they in general will lack the rule of necessitation of Kripke [63] and thus will not be normal. Hence (in our opinion), they are intuitively somewhat unnatural; but nevertheless they have an elegant model theory. Among these systems aTe, notably, Lewis's S2 and S3; this paper extends the results of Kripke [63] to these and other systems. The results of this paper were announced in Kripke [63, abstract]. All systems considered here will be formulated with axiom schemata; substitution is a derived rule.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantics of Propositional Fuzzy Modal Logic with Evaluated Syntax and its Application to Fuzzy Decision Implications

This paper deals with propositional fuzzy modal logic with evaluated syntax based on MV-algebras. We focus on its semantical theory from the viewpoint of Pavelka’s graded semantics of propositional fuzzy logic, investigate the L-tautologies based on different Kripke frames. We also define the notion of Lsemantical consequence operation, its some basic properties are obtained. Finally, this pape...

متن کامل

Graphical Sequent Calculi for Modal Logics

The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce’s notation in the gamma part of his graphical logic of existential graphs. Graphical calculi for normal modal logics are developed based on a reformulation of the graphical calculus for classical propositional logic. These graphical calculi are of the nature of deep inference. The relati...

متن کامل

Set theory and tableaux for teaching propositional logic

In this work we suggest the use of a set-theoretical interpretation of semantic tableaux for teaching propositional logic. If the student has previous notions of basic set theory, this approach to semantical tableaux can clarify her the way semantic trees operate, linking the syntactical and semantical sides of the process. Also, it may be useful for the introduction of more advanced topics in ...

متن کامل

A Semantical Analysis of Second-Order Propositional Modal Logic

This paper is aimed as a contribution to the use of formal modal languages in Artificial Intelligence. We introduce a multi-modal version of Second-order Propositional Modal Logic (SOPML), an extension of modal logic with propositional quantification, and illustrate its usefulness as a specification language for knowledge representation as well as temporal and spatial reasoning. Then, we define...

متن کامل

Proof systems: from nestings to sequents and back

In this work, we explore proof theoretical connections between sequent, nested and labelled calculi. In particular, we show a general algorithm for transforming a class of nested systems into sequent calculus systems, passing through linear nested systems. Moreover, we show a semantical characterisation of intuitionistic, multi-modal and non-normal modal logics for all these systems, via a case...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008